Minimax Polynomial Approximation
نویسندگان
چکیده
Some new methods for obtaining the minimax polynomial approximation of degree n to a continuous function are introduced, and applied to several simple functions. The amount of computation required is substantially reduced compared with that of previous methods.
منابع مشابه
Error of Truncated Chebyshev Series and Other Near Minimax Polynomial Approximations
It is well known that a near minimax polynomial approximation p is obtained by truncating the Chebyshev series of a function fafter n + 1 terms. It is shown that if /'E C' " + " [-1, I], then 1I.f-pII may be expressed in terms off' " ' I) in the same manner as the error of minimax approximation. The result is extended to other types of near minimax approximation.
متن کاملAn Approximation Error Lower Bound for Integer Polynomial Minimax Approximation
The need to solve a polynomial minimax approximation problem appears often in science. It is especially common in signal processing and in particular in filter design. The results presented in this paper originated from a study of the finite wordlength restriction in the FIR digital filter design problem. They are, however, much more general and can be applied to any polynomial minimax approxim...
متن کاملA Fast Algorithm for Linear Complex Chebyshev Approximations
We propose a new algorithm for finding best minimax polynomial approximations in the complex plane. The algorithm is the first satisfactory generalization of the well-known Remez algorithm for real approximations. Among all available algorithms, ours is the only quadratically convergent one. Numerical examples are presented to illustrate rapid convergence.
متن کاملA Minimax Polynomial Approximation Objective Function Approach for Optimal Design of Power System Stabilizer by Embedding Particle Swarm Optimization
The paper presents a novel approach based on Minimax approximation and evolutionary tool Particle Swarm Optimization (PSO) to fabricate the parameters of Power System Stabilizers (PSSs) for multi machine power systems. The proposed approach employs PSO algorithm for find the setting of PSS parameters. The worth mentioning feature of this work is the formulation of objective function with the he...
متن کاملApproximating Nash Equilibrium Via Multilinear Minimax
On the one hand we state {\it Nash equilibrium} (NE) as a formal theorem on multilinear forms and give a pedagogically simple proof, free of game theory terminology. On the other hand, inspired by this formalism, we prove a {\it multilinear minimax theorem}, a generalization of von Neumann’s bilinear minimax theorem. Next, we relate the two theorems by proving that the solution of a multilinear...
متن کامل